On algebraic abstractions for concurrent separation logics

نویسندگان

چکیده

Concurrent separation logic is distinguished by transfer of state ownership upon parallel composition and framing. The algebraic structure that underpins partial commutative monoids (PCMs). Extant research considers primarily from the logical perspective while comparatively less attention drawn to considerations. This paper provides an formalization in concurrent means structure-preserving functions (i.e., morphisms) between PCMs, associated notion separating relations. Morphisms structures are a standard concept algebra category theory, but haven't seen ubiquitous use before. Separating binary relations generalize disjointness characterize inputs on which morphisms preserve structure. two abstractions facilitate verification enabling concise ways writing specs, providing abstract views threads' states preserved under transfer, user-level construction new PCMs out existing ones.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algebraic Abstractions

In this paper we study abstraction techniques for verification problems of the form C j= , where C is a first-order structure and is a first-order formula (both w.r.t. a given signature ). This study is motivated by the need of such abstractions for the automatic verification of properties of cryptographic protocols, which in our approach are modeled by first-order structures. Our so-called alg...

متن کامل

Concurrency abstractions for Concurrent Haskell

In this article we propose a basic set of concurrency abstractions for Concurrent Haskell based on our experiences with various applications. These abstractions serve as templates for patterns recurring in concurrent program development. Especially for threads depending on each other, high-level constructs allow monitoring of a set of child threads and taking actions in case a vital component t...

متن کامل

High-Level Abstractions for Efficient Concurrent Systems

ion that permit significant programmer-level control over mapping, scheduling and load-balancing of lightweight threads. Section 7 describes abstract physical machines, and Sting’s exception handling mechanism. Section 8 provides benchmark results. Conclusions and comparison to related work is given in Section 9.

متن کامل

Towards Efficient Abstractions for Concurrent Consensus

Consensus is an often occurring problem in concurrent and distributed programming. We present a programming language with simple semantics and build-in support for consensus in the form of communicating transactions. We motivate the need for such a construct with a characteristic example of generalized consensus which can be naturally encoded in our language. We then focus on the challenges in ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the ACM on programming languages

سال: 2021

ISSN: ['2475-1421']

DOI: https://doi.org/10.1145/3434286